# #二分查找
# def binary_search(arr, key):
#     left = 0
#     right = len(arr) - 1
#     mid = (left + right) // 2
#     while arr[mid] != key:
#         if key > arr[mid]:
#             left = mid + 1
#         if key < arr[mid]:
#             right = mid - 1
#         if left > right:
#             return -1
#         mid = (left + right) // 2
#     return mid

# #顺序查找
# def linear_search(arr, key):
#     for index in range(len(arr)):
#         if arr[index] == key:
#             return index
#     return -1
# #插值查找
# def interpalotion_search(arr, key):
#     left = 0
#     right = len(arr) - 1
#     mid = 0
#     while arr[mid] != key:
#         mid = int((key - arr[left] / arr[right] - arr[left] * right - left) + left)
#         if mid < left or mid > right:
#             mid = -1
#             break

#         if key > arr[mid]:
#             left = mid + 1
#         if key < arr[mid]:
#             right = mid - 1
#         if left > right:
#             return -1
#     return mid

            
# arr = []   
# for i in range(20):
#     arr.append(i)

# key = 999999
# print(binary_search(arr, key))
# print(linear_search(arr, key))
# print(bubble_search(arr))

def pri():
    print("这是第一个函数")
def pri():
    print("这是第二个函数")

pri()

